Matching Pursuit Algorithm based on L1 norm
نویسندگان
چکیده
منابع مشابه
An Online Kernel Learning Algorithm based on Orthogonal Matching Pursuit
Matching pursuit algorithms learn a function that is weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target function in the least-squares sense. Experimental result shows that it is an effective method, but the drawbacks are that this algorithm is not appropriate to online learning or estimating the strongly nonlinear functions....
متن کاملL1-norm-based (2D)PCA
Traditional bidirectional two-dimension (2D) principal component analysis ((2D)PCA-L2) is sensitive to outliers because its objective function is the least squares criterion based on L2-norm. This paper proposes a simple but effective L1-norm-based bidirectional 2D principal component analysis ((2D)PCA-L1), which jointly takes advantage of the merits of bidirectional 2D subspace learning and L1...
متن کاملusing fourier based vectors in matching pursuit (mp) algorithm to interpolate seismic data and reconstruct traces on uniform grids
many steps of seismic data processing sequence suppose that data sets are sampled in time and spatial dimensions uniformly. today, this assumption is true but only in time dimension. modern seismic exploration equipment permits seismic data sets to be sampled uniformly and densely in time dimension. however, along spatial dimension uniform and dense sampling are not possible because of operatin...
متن کاملEfficient many-to-many feature matching under the l1 norm
Please cite this article in press as: M.F. Demirci e doi:10.1016/j.cviu.2010.12.012 Matching configurations of image features, represented as attributed graphs, to configurations of model features is an important component in many object recognition algorithms. Noisy segmentation of images and imprecise feature detection may lead to graphs that represent visually similar configurations that do ...
متن کاملA remark about orthogonal matching pursuit algorithm
In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give (p, q) instance optimality for a large class of encoders with 1 ≤ p ≤ q ≤ 2 and (p, q) 6= (2, 2). We also show that, if the encoding matrix is drawn from an appropriate distribution, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Neuroinformatics
سال: 2014
ISSN: 1662-5196
DOI: 10.3389/conf.fninf.2014.08.00015